Approximations from Subspaces of C0(X)

Approximations from Subspaces for the Singular Value Problem

The computation (or approximation) of some of the smallest or largest singular values of a large sparse matrix is a big challenge, having many important applications. In this talk we discuss approximations to singular triples that can be obtained from subspaces. One of the topics is the concept of harmonic singular triples, introduced in [1]. The word “harmonic” expresses the fact that we try t...

From Subspaces to Submanifolds

This paper identifies a broad class of nonlinear dimensionality reduced (NLDR) problems where the exact local isometry between an extrinsically curved data manifold M and a low-dimensional parameterization space can be recovered from a finite set of high-dimensional point sampels. The method, Geodesic Nullsapce Analysis (GNA), rests on two results: First, the exact isometric parameterization of...

Comment on frame's of subspaces

$varepsilon$-Simultaneous approximations of downward sets

In this paper, we prove some results on characterization of $varepsilon$-simultaneous approximations of downward sets in vector lattice Banach spaces. Also, we give some results about simultaneous approximations of normal sets.

Covering of subspaces by subspaces

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph Gq(n, r) by subspaces from the Grassmann graph Gq(n, k), k ≥ r , are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, q-analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and...